Hierarchical Task Network Planning with Task Insertion and State Constraints

نویسندگان

  • Zhanhao Xiao
  • Andreas Herzig
  • Laurent Perrussel
  • Hai Wan
  • Xiaoheng Su
چکیده

We extend hierarchical task network planning with task insertion (TIHTN) by introducing state constraints, called TIHTNS. We show that just as for TIHTN planning, all solutions of the TIHTNS planning problem can be obtained by acyclic decomposition and task insertion, entailing that its planexistence problem is decidable without any restriction on decomposition methods. We also prove that the extension by state constraints does not increase the complexity of the plan-existence problem, which stays 2-NEXPTIME-complete, based on an acyclic progression operator. In addition, we show that TIHTNS planning covers not only the original TIHTN planning but also hierarchyrelaxed hierarchical goal network planning.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Decidability of HTN Planning with Task Insertion

The field of deterministic AI planning can roughly be divided into two approaches — classical statebased planning and hierarchical task network (HTN) planning. The plan existence problem of the former is known to be decidable while it has been proved undecidable for the latter. When extending HTN planning by allowing the unrestricted insertion of tasks and ordering constraints, one obtains a fo...

متن کامل

Domain Recompilation-based Approach towards Hierarchical Task Network Planning with Constraints

In this paper, we present a domain recompilationbased approach towards specifying and handling state-trajectory constraints in Hierarchical Task Network (HTN) planning paradigm. The proposed constraint specification language is inspired by the PDDL3.0 constructs. The domain-recompilation technique is based on automata templates for the PDDL modal operators. To implement automata embedding we ha...

متن کامل

Tight Bounds for HTN Planning with Task Insertion

Hierarchical Task Network (HTN) planning with Task Insertion (TIHTN planning) is a formalism that hybridizes classical planning with HTN planning by allowing the insertion of operators from outside the method hierarchy. This additional capability has some practical benefits, such as allowing more flexibility for design choices of HTN models: the task hierarchy may be specified only partially, s...

متن کامل

Orchestrating Task Planning in Writing: The Impact of Pre-Task Planning and Within-Task Planning on Fluency, Accuracy, and Complexity of Iranian EFL Learners’ Writing

Building on Robinson’s (2001, 2003) Cognition Hypothesis, Skehan’s (1998) Limited Attentional Capacity Model, and Kellog’s (1986) model of writing, this study examined the effect of task planning on the fluency, accuracy, and complexity of 60 Iranian EFL learners’ argumentative and narrative writings under different planning conditions. A quasi-experimental design with three levels of planning ...

متن کامل

Hierarchical Planning: Relating Task and Goal Decomposition with Task Sharing

Considerable work has focused on enhancing the semantics of Hierarchical Task Networks (HTNs) in order to advance the state-of-the-art in hierarchical planning. For instance, the Hierarchical Goal Network (HGN) formalism operates over a hierarchy of goals to facilitate tighter integration of decompositional planning with classical planning. Another example is the Action Notation Markup Language...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017